A Tasks Allocation Model with Fuzzy Execution and Fuzzy Inter-Tasks Communication Times in a Distributed Computing System
نویسندگان
چکیده
Distributed computing system [DCS] offer the potential for improved performance and resource sharing. To make the best use of the computational power available it is essential to assign the tasks to that processor whose characteristics are most appropriate for the execution. In this paper we have investigated a tasks allocation problem with fuzzy execution times e i ,j and fuzzy inter tasks communication times c i ,j which is more realistic and general in nature. Times e i ,j and c i ,j have been considered to be triangular and trapezoidal numbers. The fuzzy tasks allocation problem is defuzzified and converted into crisp ones using fuzzy number ranking method. A mathematical model has been developed to determine the optimal allocation of the tasks for the crisp problem that minimizes the total cost of the program. The allocation plan that minimizes the total cost for the new crisp problem also minimizes the total time for the original fuzzy tasks allocation. Numerical examples show that the model presented in this paper offers an effective tool for handling the fuzzy tasks allocation problem
منابع مشابه
A Heuristic Model for Tasks Scheduling in Heterogeneous Distributed Real Time System under Fuzzy Environment
The development of distributed real time system (DRTS) has lead to there use in several applications including information processing, fluid flow, weather modeling, database systems, real-time high-speed simulation of dynamical systems, and image processing. Reliability analysis of these processing elements and communication links is one of the important parameter to get the system efficiency. ...
متن کاملA Fuzzy Clustering Method to Minimize the Inter Task Communication Effect for Optimal Utilization of Processor's Capacity in Distributed Real Time Systems
A distributed processing System is a collection of heterogeneous processors which requires systematic assignment of a set of “m” tasks T = {t1, t2....tm} of a program to a set of “n” processors P = {p1, p2....pn}, (where, m >> n) to achieve the efficient utilization of available processor’s capacity. If this step is not performed properly, an increase in the number of processors may actually re...
متن کاملStatic Task Scheduling in Cooperative Distributed Systems Based on Soft Computing Techniques
Static task scheduling in distributed computational systems has been so important in recent decades. Aim of schedule is optimal allocation of existing limited sources in system to input tasks so that time of program execution is decreased. Very different approaches have represented to solve this problem. Since tasks schedule problem is in non-polynomial class available methods to finding accura...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملAn Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کامل